On the Optimality of Dubins Paths across Heterogeneous Terrain

نویسندگان

  • Ricardo G. Sanfelice
  • Emilio Frazzoli
چکیده

We derive optimality conditions for the paths of a Dubins vehicle when the state space is partitioned into two patches with different vehicle’s forward velocity. We recast this problem as a hybrid optimal control problem and solve it using optimality principles for hybrid systems. Among the optimality conditions, we derive a “refraction” law at the boundary of the patches which generalizes the so-called Snell’s law of refraction in optics to the case of paths with bounded maximum curvature.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementing Dubins Airplane Paths on Fixed-wing UAVs

A well known path-planning technique for mobile robots or planar aerial vehicles is to use Dubins paths, which are minimum-distance paths between two configurations subject to the constraints of the Dubins car model. An extension of this method to a three-dimensional Dubins airplane model has recently been proposed. This chapter builds on that work showing a complete architecture for implementi...

متن کامل

Discrete Dubins Paths

A Dubins path is a shortest path with bounded curvature. The seminal result in nonholonomic motion planning is that (in the absence of obstacles) a Dubins path consists either from a circular arc followed by a segment followed by another arc, or from three circular arcs [Dubins, 1957]. Dubins original proof uses advanced calculus; later, Dubins result was reproved using control theory technique...

متن کامل

Geometric Modeling of Dubins Airplane Movement and its Metric

The time-optimal trajectory for an airplane from some starting point to some final point is studied by many authors. Here, we consider the extension of robot planer motion of Dubins model in three dimensional spaces. In this model, the system has independent bounded control over both the altitude velocity and the turning rate of airplane movement in a non-obstacle space. Here, in this paper a g...

متن کامل

On Polygonal Paths with Bounded Discrete-Curvature: The Inflection-Free Case

A shortest path joining two specified endpoint configurations that is constrained to have mean curvature at most ς on every non-zero length sub-path is called a ς-geodesic. A seminal result in non-holonomic motion planning is that (in the absence of obstacles) a 1-geodesic consists of either (i) a (unit-radius) circular arc followed by a straight segment followed by another circular arc, or (ii...

متن کامل

Differential Geometric Path Planning of Multiple UAVs

Safe and simultaneous arrival of constant speed, constant altitude unmanned air vehicles (UAVs) on target is solved by design of paths of equal lengths. The starting point for our solution is the well-known Dubins path, which is composed of circular arc and line segments, thus requiring only one simple maneuver—constant rate turn. An explicit bound can be imposed on the rate during the design a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008